1-planar graph

Results: 89



#Item
11Testing Maximal 1-planarity of Graphs with a Rotation System in Linear Time ⋆ Peter Eades1 , Seok-Hee Hong1 , Naoki Katoh2 , Giuseppe Liotta3 , Pascal Schweitzer4 , and Yusuke Suzuki5 1

Testing Maximal 1-planarity of Graphs with a Rotation System in Linear Time ⋆ Peter Eades1 , Seok-Hee Hong1 , Naoki Katoh2 , Giuseppe Liotta3 , Pascal Schweitzer4 , and Yusuke Suzuki5 1

Add to Reading List

Source URL: www.cs.usyd.edu.au

Language: English - Date: 2012-06-18 00:41:54
12De-anonymization of Heterogeneous Random Graphs in Quasilinear Time (extended abstract) Karl Bringmann1 , Tobias Friedrich2 , and Anton Krohmer2 1

De-anonymization of Heterogeneous Random Graphs in Quasilinear Time (extended abstract) Karl Bringmann1 , Tobias Friedrich2 , and Anton Krohmer2 1

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2016-01-03 06:46:27
13Lecture 25  Spectral Graph Theory Planar Graphs, part 1 December 2, 2009

Lecture 25 Spectral Graph Theory Planar Graphs, part 1 December 2, 2009

Add to Reading List

Source URL: www.cs.yale.edu

Language: English - Date: 2012-08-24 09:50:05
14Beyond Planarity: Testing Full Outer-2-Planarity in Linear Time Seok-Hee Hong1 and Hiroshi Nagamochi2 1  University of Sydney, Australia

Beyond Planarity: Testing Full Outer-2-Planarity in Linear Time Seok-Hee Hong1 and Hiroshi Nagamochi2 1 University of Sydney, Australia

Add to Reading List

Source URL: www.amp.i.kyoto-u.ac.jp

Language: English - Date: 2014-09-07 19:39:32
15MiMa Mathematics in the Making Project nLLP– 1-IT-COMENIUS-CMP MiMa Draft Toolkit November 2014

MiMa Mathematics in the Making Project nLLP– 1-IT-COMENIUS-CMP MiMa Draft Toolkit November 2014

Add to Reading List

Source URL: www.mathematicsinthemaking.eu

Language: English - Date: 2015-01-26 07:20:53
16A Linear-Time Algorithm for Testing Outer-1-Planarity? Seok-Hee Hong1 , Peter Eades1 , Naoki Katoh2 , Giuseppe Liotta3 , Pascal Schweitzer4 , and Yusuke Suzuki5 1

A Linear-Time Algorithm for Testing Outer-1-Planarity? Seok-Hee Hong1 , Peter Eades1 , Naoki Katoh2 , Giuseppe Liotta3 , Pascal Schweitzer4 , and Yusuke Suzuki5 1

Add to Reading List

Source URL: www.cs.usyd.edu.au

Language: English
17MATH 5340 — Discrete Random Structures Assignment 9 Due Monday, November 30 (before class) 1. Consider the Random Geometric Graph RGG(S, n, r), where S is the unit square. In many results about this graph, the graph is

MATH 5340 — Discrete Random Structures Assignment 9 Due Monday, November 30 (before class) 1. Consider the Random Geometric Graph RGG(S, n, r), where S is the unit square. In many results about this graph, the graph is

Add to Reading List

Source URL: www.mscs.dal.ca

Language: English - Date: 2015-11-27 15:27:22
18Combinatorial problems in geometry Jan Kynˇcl Supervisor: Doc. RNDr. Pavel Valtr, Dr.  1. J. Kynˇcl,

Combinatorial problems in geometry Jan Kynˇcl Supervisor: Doc. RNDr. Pavel Valtr, Dr. 1. J. Kynˇcl,

Add to Reading List

Source URL: kam.mff.cuni.cz

Language: English - Date: 2013-03-28 22:32:38
19Publication Edited books/proceedings: 1. S. Carpendale, W. Chen and S. Hong, Proceedings of IEEE Pacificvis 2013, IEEE TVCGS. Hong, H. Nagamochi and T. Fukunaga, Proceedings of ISAACInternational Symposi

Publication Edited books/proceedings: 1. S. Carpendale, W. Chen and S. Hong, Proceedings of IEEE Pacificvis 2013, IEEE TVCGS. Hong, H. Nagamochi and T. Fukunaga, Proceedings of ISAACInternational Symposi

Add to Reading List

Source URL: www.cs.usyd.edu.au

Language: English
20The Price of Connectivity for Feedback Vertex Set R´emy Belmonte1,∗ , Pim van ’t Hof1,∗ , Marcin Kami´ nski2 , and 3,† Dani¨el Paulusma 1

The Price of Connectivity for Feedback Vertex Set R´emy Belmonte1,∗ , Pim van ’t Hof1,∗ , Marcin Kami´ nski2 , and 3,† Dani¨el Paulusma 1

Add to Reading List

Source URL: rutcor.rutgers.edu

Language: English - Date: 2013-04-23 04:25:37